A simulated-annealing heuristic for shift scheduling using non-continuously available employees
نویسندگان
چکیده
منابع مشابه
Instruction Scheduling Using Simulated Annealing
Most nodes of modern massively-parallel computing systems contain processors that use instruction-level parallelism to increase the speed of the individual processor. In order to achieve the greatest speedup possible, the compiler must perform instruction scheduling so that instructions are presented to the processor in the order that is most efficient. Instruction scheduling is a compiler prob...
متن کاملA Simulated Annealing Algorithm for Multi Objective Flexible Job Shop Scheduling with Overlapping in Operations
In this paper, we considered solving approaches to flexible job shop problems. Makespan is not a good evaluation criterion with overlapping in operations assumption. Accordingly, in addition to makespan, we used total machine work loading time and critical machine work loading time as evaluation criteria. As overlapping in operations is a practical assumption in chemical, petrochemical, and gla...
متن کاملA hybrid constructive heuristic and simulated annealing for railway crew scheduling
Railway crew scheduling problem is the process of allocating train services to the crew duties based on the published train timetable while satisfying operational and contractual requirements. The problem is restricted by many constraints and it belongs to the class of NPhard. In this paper, we develop a mathematical model for railway crew scheduling with the aim of minimising the number of cre...
متن کاملA simulated annealing - based heuristic algorithm for job shop scheduling to minimize lateness Regular Paper
A decomposition-based optimization algorithm is proposed for solving large job shop scheduling problems with the objective of minimizing the maximum lateness. First, we use the constraint propagation theory to derive the orientation of a portion of disjunctive arcs. Then we use a simulated annealing algorithm to find a decomposition policy which satisfies the maximum number of oriented disjunct...
متن کاملAn Efficient Method for Nurse Scheduling Problem using Simulated Annealing
We applied simulated annealing algorithm to nurse scheduling problem. For time complexity problem of simulated annealing, we suggested an efficient transition rule using cost matrix for simulated annealing. The experimental results showed that the suggested method generated a nurse scheduling faster in time and better in quality compared to traditional simulated annealing.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 1996
ISSN: 0305-0548
DOI: 10.1016/0305-0548(95)00012-7